A kernel of order 2 k-c log k for vertex cover
نویسنده
چکیده
In a recent paper Soleimanfallah and Yeo proposed a kernelization algorithm for Vertex Cover which, for any xed constant c, produces a kernel of order 2k−c in polynomial time. In this paper we show how their techniques can be extended to improve the produced kernel to order 2k − c log k, for any xed constant c.
منابع مشابه
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
Given a graph G and a parameter k, the Chordal Vertex Deletion (CVD) problem asks whether there exists a subset U ⊆ V (G) of size at most k that hits all induced cycles of size at least 4. The existence of a polynomial kernel for CVD was a well-known open problem in the field of Parameterized Complexity. Recently, Jansen and Pilipczuk resolved this question affirmatively by designing a polynomi...
متن کاملOptimal Data Reduction for Graph Coloring Using Low-Degree Polynomials
The theory of kernelization can be used to rigorously analyze data reduction for graph coloring problems. Here, the aim is to reduce a q-Coloring input to an equivalent but smaller input whose size is provably bounded in terms of structural properties, such as the size of a minimum vertex cover. In this paper we settle two open problems about data reduction for q-Coloring. First, we obtain a ke...
متن کاملVertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter
Kernelization is a concept that enables the formal mathematical analysis of data reduction through the framework of parameterized complexity. Intensive research into the Vertex Cover problem has shown that there is a preprocessing algorithm which given an instance (G, k) of Vertex Cover outputs an equivalent instance (G′, k′) in polynomial time with the guarantee that G′ has at most 2k′ vertice...
متن کاملIncompressibility through Colors and IDs
In parameterized complexity each problem instance comes with a parameter k, and a parameterized problem is said to admit a polynomial kernel if there are polynomial time preprocessing rules that reduce the input instance to an instance with size polynomial in k. Many problems have been shown to admit polynomial kernels, but it is only recently that a framework for showing the non-existence of p...
متن کاملKernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators
Vertex Cover is one of the most well studied problems in the realm of parameterized algorithms and admits a kernel with O(`2) edges and 2` vertices. Here, ` denotes the size of a vertex cover we are seeking for. A natural question is whether Vertex Cover admits a polynomial kernel (or a parameterized algorithm) with respect to a parameter k, that is, provably smaller than the size of the vertex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 111 شماره
صفحات -
تاریخ انتشار 2011